On Two Dually Nondeterministic Refinement Algebras
نویسنده
چکیده
A dually nondeterministic refinement algebra with a negation operator is proposed. The algebra facilitates reasoning about totalcorrectness preserving program transformations and nondeterministic programs. The negation operator is used to express enabledness and termination operators through a useful explicit definition. As a small application, a property of action systems is proved employing the algebra. A dually nondeterministic refinement algebra without the negation operator is also discussed.
منابع مشابه
Dually quasi-De Morgan Stone semi-Heyting algebras I. Regularity
This paper is the first of a two part series. In this paper, we first prove that the variety of dually quasi-De Morgan Stone semi-Heyting algebras of level 1 satisfies the strongly blended $lor$-De Morgan law introduced in cite{Sa12}. Then, using this result and the results of cite{Sa12}, we prove our main result which gives an explicit description of simple algebras(=subdirectly irreducibles) ...
متن کاملDually quasi-De Morgan Stone semi-Heyting algebras II. Regularity
This paper is the second of a two part series. In this Part, we prove, using the description of simples obtained in Part I, that the variety $mathbf{RDQDStSH_1}$ of regular dually quasi-De Morgan Stone semi-Heyting algebras of level 1 is the join of the variety generated by the twenty 3-element $mathbf{RDQDStSH_1}$-chains and the variety of dually quasi-De Morgan Boolean semi-Heyting algebras--...
متن کاملCorrectness and Refinement of Dually Nondeterministic Programs
In this paper we extend different reasoning methods from traditional (demonic) programs to programs with both demonic and angelic nondeterminism. In particular, we discuss correctness proofs, and refinement of programs while reducing angelic nondeterminism (into demonic nondeterminism or determinism). As expected, reducing angelic nondeterminism is generally not a refinement; however, when cont...
متن کاملImplementing Inequality and Non-Deterministic Specifications with Bi-Rewriting Systems
Rewriting with non-symmetric relations can be considered as a computational model of many specification languages based on nonsymmetric relations. For instance, Logics of Inequalities, Ordered Algebras, Rewriting Logic, Order-Sorted Algebras, Subset Logic, Unified Algebras, taxonomies, subtypes, Refinement Calculus, all them use some kind of non-symmetric relation on expressions. We have develo...
متن کاملDually quasi-De Morgan Stone semi-Heyting algebras I. Regularity
This paper is the first of a two part series. In this paper, we first prove that the variety of dually quasi-De Morgan Stone semi-Heyting algebras of level 1 satisfies the strongly blended ∨-De Morgan law introduced in [20]. Then, using this result and the results of [20], we prove our main result which gives an explicit description of simple algebras(=subdirectly irreducibles) in the variety o...
متن کامل